Quotient of Acceptance Specifications Under Reachability Constraints
نویسندگان
چکیده
The quotient operation, which is dual to the composition, is crucial in specification theories as it allows the synthesis of missing specifications and thus enables incremental design. In this paper, we consider a specification theory based on marked acceptance specifications (MAS) which are automata enriched with variability information encoded by acceptance sets and with reachability constraints on states. We define a sound and complete quotient for MAS hence ensuring reachability properties by construction.
منابع مشابه
A Specification Theory for Reachability by Design
Modular design aims at building complex reactive systems by assembling components, possibly taken off-the-shelf. This approach can be supported by a specification theory in which requirements correspond to specifications while components are models of the specifications. In this article, we consider components which have to fulfill a reachability objective. A difficulty is then induced by the f...
متن کاملValidating Specifications of Dynamic Systems Using Automated Reasoning Techniques
In this paper, we propose a new approach to validating formal specifications of observable behavior of discrete dynamic systems. By observable behavior we mean system behavior as observed by users or other systems in the environment of the system. Validation of a formal specification of an informal domain tries to answer the question whether the specification actually describes the intended dom...
متن کاملVerification of infinite-state dynamic systems using approximate quotient transition systems
This paper concerns computational methods for verifying properties of labeled infinite-state transition systems (e.g., hybrid systems) using quotient transition system (QTS). A QTS is a conservative approximation to the infinite-state transition system based on a finite partition of the infinite state space. For universal specifications, positive verification for a QTS implies the specification...
متن کاملModel Checking of Continuous-Time Markov Chains Against Timed Automata Specifications
We study the verification of a finite continuous-time Markov chain (CTMC) C against a linear real-time specification given as a deterministic timed automaton (DTA) A with finite or Muller acceptance conditions. The central question that we address is: what is the probability of the set of paths of C that are accepted by A, i.e., the likelihood that C satisfies A? It is shown that under finite a...
متن کاملMaria: Modular Reachability Analyser for Algebraic System Nets
Maria performs simulation, exhaustive reachability analysis and on-the-fly LTL model checking of high-level Petri nets with fairness constraints. The algebra contains powerful built-in data types and operations. Models can be exported to low-level Petri nets and labelled transition systems. Translator programs allow Maria to analyse transition systems as well as distributed computer programs wr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015